- stable sorting
- сортировка с сохранением
English-Russian dictionary of computer science. 2015.
stable sorting
Смотреть что такое "stable sorting" в других словарях:
Sorting algorithm — In computer science, a sorting algorithm is an algorithm that puts elements of a list in a certain order. The most used orders are numerical order and lexicographical order. Efficient sorting is important for optimizing the use of other… … Wikipedia
Sorting — For the sorting of sediment, see Sorting (sediment). Sorting type Sorting is any process of arranging items in some sequence and/or in different sets, and accordingly, it has two common, yet distinct meanings: ordering: arranging items of the… … Wikipedia
Stable algorithm — * In computer science, a stable sorting algorithm is a sorting algorithm that preserves the order of records with equal keys. * In numerical analysis, a numerically stable algorithm is an algorithm that is numerically stable … Wikipedia
Maximally stable extremal regions — Feature detection Output of a typical corner detection algorithm … Wikipedia
Spike sorting — Le spike sorting (littéralement triage de potentiels d action) est un procédé permettant d extraire d un enregistrement électrophysiologique extracellulaire les potentiels d actions (les spikes) provenant d un neurone bien défini. Sommaire 1… … Wikipédia en Français
Radix sort — In computer science, radix sort is a sorting algorithm that sorts integers by processing individual digits. Because integers can represent strings of characters (e.g., names or dates) and specially formatted floating point numbers, radix sort is… … Wikipedia
Cocktail sort — Class Sorting algorithm Data structure Array Worst case performance О(n²) Best case performance O(n) … Wikipedia
Unicode equivalence — is the specification by the Unicode character encoding standard that some sequences of code points represent essentially the same character. This feature was introduced in the standard to allow compatibility with preexisting standard character… … Wikipedia
Splay tree — A splay tree is a self balancing binary search tree with the additional property that recently accessed elements are quick to access again. It performs basic operations such as insertion, look up and removal in O(log(n)) amortized time. For many… … Wikipedia
алгоритм сортировки с сохранением — — [http://www.iks media.ru/glossary/index.html?glossid=2400324] Тематики электросвязь, основные понятия EN stable sorting algorithm … Справочник технического переводчика
Comparison sort — Sorting a set of unlabelled weights by weight using only a balance scale requires a comparison sort algorithm A comparison sort is a type of sorting algorithm that only reads the list elements through a single abstract comparison operation (often … Wikipedia
